By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 10, Issue 4, pp. 657-819

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Parallel Matrix and Graph Algorithms

Eliezer Dekel, David Nassimi, and Sartaj Sahni

pp. 657-675

BibTeX  Abstract Full Text:  PDF

On a Greedy Heuristic for Complete Matching

Edward M. Reingold and Robert E. Tarjan

pp. 676-681

BibTeX  Abstract Full Text:  PDF

Fast, Efficient Parallel Algorithms for Some Graph Problems

Carla Savage and Joseph Ja'Ja'

pp. 682-691

BibTeX  Abstract Full Text:  PDF

Information Dissemination in Trees

P. J. Slater, E. J. Cockayne, and S. T. Hedetniemi

pp. 692-701

BibTeX  Abstract Full Text:  PDF

Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks

Sam Toueg and Kenneth Steiglitz

pp. 702-712

BibTeX  Abstract Full Text:  PDF

The NP-Completeness of Some Edge-Partition Problems

Ian Holyer

pp. 713-717

BibTeX  Abstract Full Text:  PDF

The NP-Completeness of Edge-Coloring

Ian Holyer

pp. 718-720

BibTeX  Abstract Full Text:  PDF

Optimal Retrieval Algorithms for Small Region Queries

Azad Bolour

pp. 721-741

BibTeX  Abstract Full Text:  PDF

Limitations on Separating Nondeterministic Complexity Classes

Charles W. Rackoff and Joel I. Seiferas

pp. 742-745

BibTeX  Abstract Full Text:  PDF

Covering Graphs by Simple Circuits

Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, and M. Rodeh

pp. 746-750

BibTeX  Abstract Full Text:  PDF

Power of Natural Semijoins

Philip A. Bernstein and Nathan Goodman

pp. 751-771

BibTeX  Abstract Full Text:  PDF

Minimizing the Number of Evaluation Passes for Attribute Grammars

Kari-Jouko Räihä and Esko Ukkonen

pp. 772-786

BibTeX  Abstract Full Text:  PDF

Completeness, Approximation and Density

Ker-I Ko and Daniel Moore

pp. 787-796

BibTeX  Abstract Full Text:  PDF

An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph

Maciej M. Syslo

pp. 797-808

BibTeX  Abstract Full Text:  PDF

Distributed Processor Scheduling and User Countermeasures

Amnon B. Barak and Peter J. Downey

pp. 809-819

BibTeX  Abstract Full Text:  PDF